Heuristic Search Based Localization in Mobile Computational Grid
نویسندگان
چکیده
منابع مشابه
Heuristic Task Allocation Strategies for Computational Grid
Ashish V. Chandak Department of Computer Science and Engineering, National Institute of Technology, Rourkela, India Email: [email protected] Bibhudatta Sahoo Department of Computer Science and Engineering, National Institute of Technology, Rourkela, India Email: [email protected] Ashok Kumar Turuk Department of Computer Science and Engineering, National Institute of Technology, Rourkel...
متن کامل3-D Grid-Based Localization Technique in Mobile Sensor Networks
Considering the environmental protection, forest fire becomes a more and more serious problem and requires more concerns. This paper provides an efficient method for fire monitoring and detection in forests using wireless sensor network technology. The proposed technique estimates the location of a sensor node based on the current set of hop-count values, which are collected through the anchor ...
متن کاملMigration Transparency in a Mobile Agent Based Computational Grid
In recent years, Grid computing has emerged as a promising alternative to increase the capacity of processing and storage, through integration and sharing of multi-institutional resources. MAG (Mobile Agents for Grid Computing Environments)is a research project that explores the mobile agent paradigm as a way to overcome the design and implementation challenges of developing a Grid middleware. ...
متن کاملFuzzy uncertainty modeling for grid based localization of mobile robots
This paper presents a localization method using fuzzy logic to represent the different facets of uncertainty present in sensor data. Our method follows the typical predict-update cycle of recursive state estimators to estimate the robot’s location. The method is implemented on a fuzzy position grid, and several simplifications are introduced to reduce computational complexity. The main advantag...
متن کاملHeuristic Search-Based Replanning
Many real-world planning problems require one to solve a series of similar planning tasks. In this case, replanning can be much faster than planning from scratch. In this paper, we introduce a novel replanning method for symbolic planning with heuristic search-based planners, currently the most popular planners. Our SHERPA replanner is not only the first heuristic search-based replanner but, di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2922400